The Post correspondence problem in groups

We generalize the classical Post correspondence problem (PCPn) and its non-homogeneous variation (GPCPn) to non-commutative groups and study the computational complexity of these new problems. We observe that PCPn is closely related to the equalizer problem in groups, while GPCPn is connected to the double twisted conjugacy problem for endomorphisms. Furthermore, it is shown that one of the strongest forms of the word problem in a group G (we call it the hereditary word problem) can be reduced to GPCPn in G in polynomial time. The main results are that PCPn is decidable in a finitely generated nilpotent group in polynomial time, while GPCPn is undecidable in any group containing free non-abelian subgroup (though the argument is very different from the classical case of free semigroups). We show that the double endomorphism twisted conjugacy problem is undecidable in free groups of sufficiently large finite rank. We also consider the bounded PCP and observe that it is in NP for any group with P-time decidable word problem, meanwhile it is NP-hard in any group containing free non-abelian subgroup. In particular, the bounded PCP is NP-complete in non-elementary hyperbolic groups and non-abelian right angle Artin groups.